Faster optimal algorithms for segment minimization with small maximal value
نویسندگان
چکیده
منابع مشابه
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value
The segment minimization problem consists of finding a smallest set of binary matrices (segments), where non-zero values in each row of each matrix are consecutive, each matrix is assigned a positive integer weight (a segment-value), and the weighted sum of the matrices corresponds to the given input intensity matrix. This problem has direct applications in intensitymodulated radiation therapy,...
متن کاملFaster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
A repeat in a string is a substring that occurs more than once. A repeat is extendible if every occurrence of the repeat has an identical letter either on the left or on the right; otherwise, it is maximal. A multirepeat is a repeat that occurs at least mmin times (mmin ≥ 2) in each of at least q ≥ 1 strings in a given set of strings. In this paper, we describe a family of efficient algorithms ...
متن کاملSmall Maximal Independent Sets and Faster Exact Graph Coloring
We show that, for any n-vertex graph G and integer parameter k, there are at most 34k−n4n−3k maximal independent sets I ⊂ G with |I| ≤ k, and that all such sets can be listed in time O(34k−n4n−3k). These bounds are tight when n/4 ≤ k ≤ n/3. As a consequence, we show how to compute the exact chromatic number of a graph in time O((4/3 + 3/4)) ≈ 2.4150, improving a previous O((1 + 3)) ≈ 2.4422 alg...
متن کاملOptimal memory minimization algorithms for the multifrontal method
We are interested in the active and total memory usage of the mul-tifrontal method. Starting from the algorithms proposed by Liu, we suggest a new scheme together with a tree traversal that give an optimal peak of active memory. Significant gains are obtained compared to Liu's approach. We also study the problem of minimizing the total memory and compare various new schemes. A number of experim...
متن کاملOptimal algorithms for the average-constrained maximum-sum segment problem
a r t i c l e i n f o a b s t r a c t Given a real number sequence A = (a 1 , a 2 ,. .. ,a n), an average lower bound L, and an average upper bound U , the Average-Constrained Maximum-Sum Segment problem is to locate a segment A(i, j) = (a i , a i+1 ,. .. ,a j) that maximizes ik j a k subject to L (ik j a k)/(j − i + 1) U. In this paper, we give an O (n)-time algorithm for the case where the av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.09.011